Constructing Cyclic PBIBD(2)s through an Optimization Approach: Thirty Two New Cyclic Designs
نویسنده
چکیده
We formulate the construction of cyclic partially balanced incomplete block designs with 2 associate classes as a combinatorial optimization problem. We propose an algorithm based on tabu search to tackle the problem. Our algorithm constructed 32 new cyclic designs.
منابع مشابه
Constructing some PBIBD(2)s by Tabu Search Algorithm
Some papers have dealt with the construction of 2-concurrence designs as an optimization problem. In this paper we generalize these results to formulate also the construction of partially balanced incomplete block designs with 2 associate classes as a combinatorial optimization problem. We will propose an algorithm based on tabu search to construct many of these designs. Our algorithm was able ...
متن کاملCyclic Polygonal Designs with Block Size 3 and λ = 1 for Joint Distance α = 6 to 16
Stufken (1993) first introduced cyclic polygonal designs (CPDs) (in terms of cyclic balanced sampling plans excluding adjacent units (CBSAs)) for joint distance α ≥ 2. Wei (2002) first suggested the use of Langford sequence for the existence and construction of CPDs with block size k = 3 and λ = 1 for arbitrary α . Zhang and Chang (2005b) used Langford and extended Langford sequence, and constr...
متن کاملA New Solution for the Cyclic Multiple-Part Type Three-Machine Robotic Cell Problem based on the Particle Swarm Meta-heuristic
In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...
متن کاملQuasi-Cyclic Codes from Cyclic-Structured Designs with Good Properties
Quasi-cyclic Codes from Cyclic-Structured Designs with Good Properties Dimitris E. Simos and Christos Koukouvinos Department of Mathematics National Technical University of Athens Zografou 15773, Athens, Greece {dsimos,ckoukouv}@math.ntua.gr Quasi-cyclic (QC) codes form an important class of linear codes, which contains the well-known class of cyclic codes. A linear code with a complementary du...
متن کاملA Fast Algorithm for Constructing Efficient Event-Related
7 We propose a novel, efficient approach for obtaining high-quality experimental designs for 8 event-related functional magnetic resonance imaging (ER-fMRI). Our approach combines a 9 greedy hillclimbing algorithm and a cyclic permutation method. When searching for optimal 10 ER-fMRI designs, the proposed approach focuses only on a promising restricted class of 11 designs with equal frequency o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004